<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Library Evolutionary Algorithms for Clustering (LEAC): Class Hierarchy</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="leac_logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Library Evolutionary Algorithms for Clustering (LEAC)
   &#160;<span id="projectnumber">Version 1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">Class Hierarchy</div>  </div>
</div><!--header-->
<div class="contents">
<div class="textblock">
<p><a href="inherits.html">Go to the graphical class hierarchy</a></p>
This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span><span onclick="javascript:toggleLevel(5);">5</span><span onclick="javascript:toggleLevel(6);">6</span><span onclick="javascript:toggleLevel(7);">7</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct___g_n_u_p_l_o_t___c_t_r_l__.html" target="_self">_GNUPLOT_CTRL_</a></td><td class="desc"></td></tr>
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgraph_1_1_algorithms_d_f_s.html" target="_self">graph::AlgorithmsDFS</a></td><td class="desc">Depth-first search algorithms </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html" target="_self">graph::AlgorithmsDFSAdjMatrix&lt; T_BITSIZE &gt;</a></td><td class="desc">Depth-first search algorithms for a matrix of bits </td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_bit_container.html" target="_self">ds::BitContainer&lt; T_BITSIZE &gt;</a></td><td class="desc">Bit container </td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_bit_array.html" target="_self">mat::BitArray&lt; T_BITSIZE &gt;</a></td><td class="desc">Bit array </td></tr>
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_bit_array.html" target="_self">gaencode::ChromosomeBitArray&lt; T_BITSIZE, T_METRIC &gt;</a></td><td class="desc">Chromosome encoding string of bits </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_bit_matrix.html" target="_self">mat::BitMatrix&lt; T_BITSIZE &gt;</a></td><td class="desc">Bit matrix </td></tr>
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_4_0_" class="arrow" onclick="toggleFolder('4_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_crisp_matrix.html" target="_self">mat::CrispMatrix&lt; T_BITSIZE, T_CLUSTERIDX &gt;</a></td><td class="desc">Bit crisp matrix </td></tr>
<tr id="row_4_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_crisp_matrix.html" target="_self">gaencode::ChromosomeCrispMatrix&lt; T_BITSIZE, T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc">Chromosome bit crisp matrix </td></tr>
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_base.html" target="_self">gaencode::ChromosomeBase&lt; T_METRIC &gt;</a></td><td class="desc">Chromosome Base define basic attributes for a chromosome </td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_0_" class="arrow" onclick="toggleFolder('5_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_string.html" target="_self">gaencode::ChromosomeString&lt; T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc"></td></tr>
<tr id="row_5_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_5_0_0_" class="arrow" onclick="toggleFolder('5_0_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chrom_fixed_length.html" target="_self">gaencode::ChromFixedLength&lt; T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc"></td></tr>
<tr id="row_5_0_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_f_e_a_c.html" target="_self">gaencode::ChromosomeFEAC&lt; T_CLUSTERIDX, T_METRIC, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Chromosome encoded integer string and centroids </td></tr>
<tr id="row_5_0_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_f_g_k_a.html" target="_self">gaencode::ChromosomeFGKA&lt; T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc">Chromosome fixed length string and legality ration </td></tr>
<tr id="row_5_0_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_g_g_a.html" target="_self">gaencode::ChromosomeGGA&lt; T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc">Chromosome encoding two parts </td></tr>
<tr id="row_5_0_0_3_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_i_g_k_a.html" target="_self">gaencode::ChromosomeIGKA&lt; T_CLUSTERIDX, T_METRIC, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Chromosome IGKA </td></tr>
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_bit_array.html" target="_self">gaencode::ChromosomeBitArray&lt; T_BITSIZE, T_METRIC &gt;</a></td><td class="desc">Chromosome encoding string of bits </td></tr>
<tr id="row_5_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_crisp_matrix.html" target="_self">gaencode::ChromosomeCrispMatrix&lt; T_BITSIZE, T_CLUSTERIDX, T_METRIC &gt;</a></td><td class="desc">Chromosome bit crisp matrix </td></tr>
<tr id="row_5_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_matrix_with_row_null.html" target="_self">gaencode::ChromosomeMatrixWithRowNull&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Matrix with row null chromosome </td></tr>
<tr id="row_5_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_4_" class="arrow" onclick="toggleFolder('5_4_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_string.html" target="_self">gaencode::ChromosomeString&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Chhromosome String define Chromosome encode for an string </td></tr>
<tr id="row_5_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chrom_fixed_length.html" target="_self">gaencode::ChromFixedLength&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Chromosome with fixed length string </td></tr>
<tr id="row_5_4_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chrom_variable_length.html" target="_self">gaencode::ChromVariableLength&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Chromosome with variable length string </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_c_b_g_a.html" target="_self">gaencode::ChromosomeCBGA&lt; T_FEATURE, T_CLUSTERIDX, T_INSTANCE_FREQUENCY, T_INSTANCES_CLUSTER_K, T_FEATURE_SUM, T_REAL &gt;</a></td><td class="desc">A set of centroids stands for a codebook of the application and the partitions <a class="el" href="citelist.html#CITEREF_Franti:etal:GAclustering:gafranti:1997">[17]</a> </td></tr>
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_count_label.html" target="_self">data::CountLabel&lt; T_IDX_LABEL, T_COUNT_LABEL &gt;</a></td><td class="desc">Stores the number of occurrences of a label for an attribute in a dataset </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_count_label.html" target="_self">data::CountLabel&lt; T_CLUSTERIDX, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc"></td></tr>
<tr id="row_9_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_disj_sets.html" target="_self">ds::DisjSets</a></td><td class="desc">Disjoint-set </td></tr>
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_disj_sets.html" target="_self">partition::PartitionDisjSets&lt; T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances in base DisjSets data structure </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_dist.html" target="_self">dist::Dist&lt; T_DIST, T_FEATURE &gt;</a></td><td class="desc">Generic dist </td></tr>
<tr id="row_10_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_euclidean.html" target="_self">dist::Euclidean&lt; T_DIST, T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="structdist_1_1_euclidean.html" title="Euclidean distance.">Euclidean</a> distance </td></tr>
<tr id="row_10_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_euclidean_squared.html" target="_self">dist::EuclideanSquared&lt; T_DIST, T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="structdist_1_1_euclidean.html" title="Euclidean distance.">Euclidean</a> distance sqrt </td></tr>
<tr id="row_10_2_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_10_2_" class="arrow" onclick="toggleFolder('10_2_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_induced.html" target="_self">dist::Induced&lt; T_DIST, T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="structdist_1_1_dist.html" title="Generic dist.">Dist</a> induced for real number <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> <a class="el" href="citelist.html#CITEREF_Bezdek:etal:ClusterAnalysis:FCM:1984">[6]</a> <a class="el" href="citelist.html#CITEREF_Bezdek:etal:GAclustering:GA:1994">[7]</a> </td></tr>
<tr id="row_10_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_induced_square_root.html" target="_self">dist::InducedSquareRoot&lt; T_DIST, T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="structdist_1_1_dist.html" title="Generic dist.">Dist</a> induced sqrt for real number <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> <a class="el" href="citelist.html#CITEREF_Bezdek:etal:ClusterAnalysis:FCM:1984">[6]</a> <a class="el" href="citelist.html#CITEREF_Bezdek:etal:GAclustering:GA:1994">[7]</a> </td></tr>
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdist_1_1_dist.html" target="_self">dist::Dist&lt; T_METRIC, T_FEATURE &gt;</a></td><td class="desc"></td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgafuncobj_1_1_g_a_function_objective.html" target="_self">gafuncobj::GAFunctionObjective&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Definition of the abstract class <a class="el" href="classgafuncobj_1_1_g_a_function_objective.html" title="Definition of the abstract class GAFunctionObjective. It is used to evaluate an objective function,...">GAFunctionObjective</a>. It is used to evaluate an objective function, in a virtual way in some other function </td></tr>
<tr id="row_13_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgafuncobj_1_1_g_a_function_objective.html" target="_self">gafuncobj::GAFunctionObjective&lt; T_FEATURE, T_METRIC &gt;</a></td><td class="desc"></td></tr>
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgafuncobj_1_1_g_a_func_obj_s_s_e.html" target="_self">gafuncobj::GAFuncObjSSE&lt; T_FEATURE, T_CLUSTERIDX, T_METRIC, INPUT_ITERATOR &gt;</a></td><td class="desc">Definition of the class <a class="el" href="classgafuncobj_1_1_g_a_func_obj_s_s_e.html" title="Definition of the class GAFuncObjSSE. .">GAFuncObjSSE</a>. <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_algorithmo.html" target="_self">inout::InParamAlgorithmo</a></td><td class="desc">Input parameter for define propertys of the algorithmos </td></tr>
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_14_0_" class="arrow" onclick="toggleFolder('14_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_clustering.html" target="_self">inout::InParamClustering</a></td><td class="desc">Input parameter for clustering algorithm </td></tr>
<tr id="row_14_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_14_0_0_" class="arrow" onclick="toggleFolder('14_0_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_clustering_max_iter.html" target="_self">inout::InParamClusteringMaxIter</a></td><td class="desc">Input parameter for algorithm with iteration maximum </td></tr>
<tr id="row_14_0_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_c_m.html" target="_self">inout::InParamFCM&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for FCM algorithm clustering <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> </td></tr>
<tr id="row_14_0_0_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_iso_data.html" target="_self">inout::InParamIsoData&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for IsoData algorithm </td></tr>
<tr id="row_14_0_0_2_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_kmeans.html" target="_self">inout::InParamKmeans&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_14_0_0_3_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_a_m.html" target="_self">inout::InParamPAM&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for Medoids PAM algorithm <a class="el" href="citelist.html#CITEREF_Kaufman:Rousseeuw:Book:ClusterAnalysis:1990">[25]</a> </td></tr>
<tr id="row_14_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_d_b_s_c_a_n.html" target="_self">inout::InParamDBSCAN&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for DBSCAN algorithm <a class="el" href="citelist.html#CITEREF_Ester:Kriegel:Sander:Xu:Clustering:DBSCAN:1996">[Est]</a> </td></tr>
<tr id="row_14_0_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_14_0_2_" class="arrow" onclick="toggleFolder('14_0_2_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_a_clustering.html" target="_self">inout::InParamGAClustering</a></td><td class="desc">Input parameter for genetic algorithm </td></tr>
<tr id="row_14_0_2_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm.html" target="_self">inout::InParamAdaptivePcPm&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_14_0_2_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm_fk.html" target="_self">inout::InParamAdaptivePcPmFk&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_14_0_2_2_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_e_a_c.html" target="_self">inout::InParamFEAC&lt; T_FEATURE, T_REAL, T_CLUSTERIDX, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter Fast Evolutionary Algorithm for Clustering F-EAC <a class="el" href="citelist.html#CITEREF_Alves:etal:GAclusteringLabelKVar:FEAC:2006">[2]</a> </td></tr>
<tr id="row_14_0_2_3_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span id="arr_14_0_2_3_" class="arrow" onclick="toggleFolder('14_0_2_3_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm.html" target="_self">inout::InParamPcPm&lt; T_REAL &gt;</a></td><td class="desc">Input parameter for GA with probability crossover (Pc) and mutation (Pm) </td></tr>
<tr id="row_14_0_2_3_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span id="arr_14_0_2_3_0_" class="arrow" onclick="toggleFolder('14_0_2_3_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_fk.html" target="_self">inout::InParamPcPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Fixed K </td></tr>
<tr id="row_14_0_2_3_0_0_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_a_prototypes_fk.html" target="_self">inout::InParamGAPrototypesFk&lt; T_BITSIZE, T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA-Prototypes algorithm <a class="el" href="citelist.html#CITEREF_Kuncheva:Bezdek:GAMedoid:GAPrototypes:1997">[27]</a> </td></tr>
<tr id="row_14_0_2_3_0_1_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;">&#160;</span><span id="arr_14_0_2_3_0_1_" class="arrow" onclick="toggleFolder('14_0_2_3_0_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_c_a.html" target="_self">inout::InParamGCA&lt; T_CLUSTERIDX, T_INSTANCEIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GCA algorithm k-medoid clustering <a class="el" href="citelist.html#CITEREF_Lucasius:etal:GAclusteringMedoid:GCA:1993">[30]</a> </td></tr>
<tr id="row_14_0_2_3_0_1_0_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_h_k_a.html" target="_self">inout::InParamHKA&lt; T_CLUSTERIDX, T_INSTANCEIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for HKA a hybrid algorithm for k-medoid clustering <a class="el" href="citelist.html#CITEREF_Sheng:Xiaohui:GAclusteringMedoid:HKA:2004">[37]</a> </td></tr>
<tr id="row_14_0_2_3_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span id="arr_14_0_2_3_1_" class="arrow" onclick="toggleFolder('14_0_2_3_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_vk.html" target="_self">inout::InParamPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Variable K </td></tr>
<tr id="row_14_0_2_3_1_0_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_gen_w_o_chg_vk.html" target="_self">inout::InParamGenWOChgVk&lt; T_BITSIZE, T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter Document clustering into an unknown number of clusters using a genetic algorithm <a class="el" href="citelist.html#CITEREF_Casillas:etal:GAclusteringVarK:GA:2003">[10]</a> </td></tr>
<tr id="row_14_0_2_3_1_1_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_t_g_c_a.html" target="_self">inout::InParamTGCA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for TGCA a two-stage genetic algorithm <a class="el" href="citelist.html#CITEREF_He:Tan:GAclusteringVarK:TGCA:2012">[18]</a> </td></tr>
<tr id="row_14_0_2_3_2_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_sub_cluster_binary_vk.html" target="_self">inout::InParamSubClusterBinaryVk&lt; T_REAL, T_BITSIZE, T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for CLUSTERING algorithm A genetic approach to the automatic clustering problem<a class="el" href="citelist.html#CITEREF_Tseng:Yang:GAclusteringVarK:CLUSTERING:2001">[38]</a> </td></tr>
<tr id="row_14_0_2_4_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span id="arr_14_0_2_4_" class="arrow" onclick="toggleFolder('14_0_2_4_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pm.html" target="_self">inout::InParamPm&lt; T_REAL &gt;</a></td><td class="desc">Input parameter for GA with only probability mutation (Pm) </td></tr>
<tr id="row_14_0_2_4_0_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_c_b_g_a.html" target="_self">inout::InParamCBGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K, T_INSTANCE_FREQUENCY &gt;</a></td><td class="desc">Input parameter for CBGA <a class="el" href="citelist.html#CITEREF_Franti:etal:GAclustering:gafranti:1997">[17]</a> </td></tr>
<tr id="row_14_0_2_4_1_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pm_fk.html" target="_self">inout::InParamPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GKA with only probability mutation (Pm) and Fixed K <a class="el" href="citelist.html#CITEREF_Krishna:Murty:GAClustering:GKA:1999">[26]</a> </td></tr>
<tr id="row_14_0_2_5_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_fk.html" target="_self">inout::InParamWithoutPcPmFk&lt; T_CLUSTERIDX, T_BITSIZE, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Bezdek:etal:GAclustering:GA:1994">[7]</a> </td></tr>
<tr id="row_14_0_2_6_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_vk.html" target="_self">inout::InParamWithoutPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Hruschka:Ebecken:GAClusteringLabelKVar:CGA:2003">[19]</a> </td></tr>
<tr id="row_14_0_3_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_g_a.html" target="_self">inout::InParamGGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GGA algorithm <a class="el" href="citelist.html#CITEREF_Agustin:etal:GAclusteringVarK:GGA:2012">[1]</a> </td></tr>
<tr id="row_14_0_4_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_slink.html" target="_self">inout::InParamSlink&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_a.html" target="_self">inout::InParamPCA&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA Algorithmo </td></tr>
<tr id="row_14_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_atransmatrix.html" target="_self">inout::InParamPCAtransmatrix&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA transformation matrix </td></tr>
<tr id="row_14_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_atransmatrix.html" target="_self">inout::InParamPCAtransmatrix&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA transformation matrix </td></tr>
<tr id="row_14_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_plot_clustering.html" target="_self">inout::InParamPlotClustering&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for plot clustering </td></tr>
<tr id="row_14_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_std_var.html" target="_self">inout::InParamStdVar&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for standardization of variables Algorithmo </td></tr>
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_fk.html" target="_self">inout::InParamFk&lt; T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for algorithms with Fixed K </td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm.html" target="_self">inout::InParamAdaptivePcPm&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm_fk.html" target="_self">inout::InParamAdaptivePcPmFk&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_c_b_g_a.html" target="_self">inout::InParamCBGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K, T_INSTANCE_FREQUENCY &gt;</a></td><td class="desc">Input parameter for CBGA <a class="el" href="citelist.html#CITEREF_Franti:etal:GAclustering:gafranti:1997">[17]</a> </td></tr>
<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_c_m.html" target="_self">inout::InParamFCM&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for FCM algorithm clustering <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> </td></tr>
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_iso_data.html" target="_self">inout::InParamIsoData&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for IsoData algorithm </td></tr>
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_kmeans.html" target="_self">inout::InParamKmeans&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_a_m.html" target="_self">inout::InParamPAM&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for Medoids PAM algorithm <a class="el" href="citelist.html#CITEREF_Kaufman:Rousseeuw:Book:ClusterAnalysis:1990">[25]</a> </td></tr>
<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_fk.html" target="_self">inout::InParamPcPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Fixed K </td></tr>
<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pm_fk.html" target="_self">inout::InParamPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GKA with only probability mutation (Pm) and Fixed K <a class="el" href="citelist.html#CITEREF_Krishna:Murty:GAClustering:GKA:1999">[26]</a> </td></tr>
<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_slink.html" target="_self">inout::InParamSlink&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_15_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_fk.html" target="_self">inout::InParamWithoutPcPmFk&lt; T_CLUSTERIDX, T_BITSIZE, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Bezdek:etal:GAclustering:GA:1994">[7]</a> </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_read_inst.html" target="_self">inout::InParamReadInst&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for read instances </td></tr>
<tr id="row_16_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm.html" target="_self">inout::InParamAdaptivePcPm&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_16_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_adaptive_pc_pm_fk.html" target="_self">inout::InParamAdaptivePcPmFk&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for EA with adaptive probabilities of crossover and mutation <a class="el" href="citelist.html#CITEREF_Chang:etal:GAclustering:GAGR:2009">[11]</a> </td></tr>
<tr id="row_16_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_d_b_s_c_a_n.html" target="_self">inout::InParamDBSCAN&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for DBSCAN algorithm <a class="el" href="citelist.html#CITEREF_Ester:Kriegel:Sander:Xu:Clustering:DBSCAN:1996">[Est]</a> </td></tr>
<tr id="row_16_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_c_m.html" target="_self">inout::InParamFCM&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for FCM algorithm clustering <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> </td></tr>
<tr id="row_16_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_e_a_c.html" target="_self">inout::InParamFEAC&lt; T_FEATURE, T_REAL, T_CLUSTERIDX, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter Fast Evolutionary Algorithm for Clustering F-EAC <a class="el" href="citelist.html#CITEREF_Alves:etal:GAclusteringLabelKVar:FEAC:2006">[2]</a> </td></tr>
<tr id="row_16_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_g_a.html" target="_self">inout::InParamGGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GGA algorithm <a class="el" href="citelist.html#CITEREF_Agustin:etal:GAclusteringVarK:GGA:2012">[1]</a> </td></tr>
<tr id="row_16_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_iso_data.html" target="_self">inout::InParamIsoData&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for IsoData algorithm </td></tr>
<tr id="row_16_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_kmeans.html" target="_self">inout::InParamKmeans&lt; T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_16_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_a_m.html" target="_self">inout::InParamPAM&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for Medoids PAM algorithm <a class="el" href="citelist.html#CITEREF_Kaufman:Rousseeuw:Book:ClusterAnalysis:1990">[25]</a> </td></tr>
<tr id="row_16_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_a.html" target="_self">inout::InParamPCA&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA Algorithmo </td></tr>
<tr id="row_16_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_atransmatrix.html" target="_self">inout::InParamPCAtransmatrix&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA transformation matrix </td></tr>
<tr id="row_16_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_p_c_atransmatrix.html" target="_self">inout::InParamPCAtransmatrix&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for PCA transformation matrix </td></tr>
<tr id="row_16_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_fk.html" target="_self">inout::InParamPcPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Fixed K </td></tr>
<tr id="row_16_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_vk.html" target="_self">inout::InParamPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Variable K </td></tr>
<tr id="row_16_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_plot_clustering.html" target="_self">inout::InParamPlotClustering&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for plot clustering </td></tr>
<tr id="row_16_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pm_fk.html" target="_self">inout::InParamPmFk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GKA with only probability mutation (Pm) and Fixed K <a class="el" href="citelist.html#CITEREF_Krishna:Murty:GAClustering:GKA:1999">[26]</a> </td></tr>
<tr id="row_16_16_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_16_16_" class="arrow" onclick="toggleFolder('16_16_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_read_inst_freq.html" target="_self">inout::InParamReadInstFreq&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX, T_INSTANCE_FREQUENCY &gt;</a></td><td class="desc">Input parameter for read instances with frequency </td></tr>
<tr id="row_16_16_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_c_b_g_a.html" target="_self">inout::InParamCBGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K, T_INSTANCE_FREQUENCY &gt;</a></td><td class="desc">Input parameter for CBGA <a class="el" href="citelist.html#CITEREF_Franti:etal:GAclustering:gafranti:1997">[17]</a> </td></tr>
<tr id="row_16_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_slink.html" target="_self">inout::InParamSlink&lt; T_CLUSTERIDX, T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for traditional algorithm clustering <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_16_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_std_var.html" target="_self">inout::InParamStdVar&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Input parameter for standardization of variables Algorithmo </td></tr>
<tr id="row_16_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_sub_cluster_binary_vk.html" target="_self">inout::InParamSubClusterBinaryVk&lt; T_REAL, T_BITSIZE, T_CLUSTERIDX, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for CLUSTERING algorithm A genetic approach to the automatic clustering problem<a class="el" href="citelist.html#CITEREF_Tseng:Yang:GAclusteringVarK:CLUSTERING:2001">[38]</a> </td></tr>
<tr id="row_16_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_fk.html" target="_self">inout::InParamWithoutPcPmFk&lt; T_CLUSTERIDX, T_BITSIZE, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Bezdek:etal:GAclustering:GA:1994">[7]</a> </td></tr>
<tr id="row_16_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_vk.html" target="_self">inout::InParamWithoutPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Hruschka:Ebecken:GAClusteringLabelKVar:CGA:2003">[19]</a> </td></tr>
<tr id="row_17_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="toggleFolder('17_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_vk.html" target="_self">inout::InParamVk&lt; T_CLUSTERIDX &gt;</a></td><td class="desc"></td></tr>
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_f_e_a_c.html" target="_self">inout::InParamFEAC&lt; T_FEATURE, T_REAL, T_CLUSTERIDX, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter Fast Evolutionary Algorithm for Clustering F-EAC <a class="el" href="citelist.html#CITEREF_Alves:etal:GAclusteringLabelKVar:FEAC:2006">[2]</a> </td></tr>
<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_g_g_a.html" target="_self">inout::InParamGGA&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GGA algorithm <a class="el" href="citelist.html#CITEREF_Agustin:etal:GAclusteringVarK:GGA:2012">[1]</a> </td></tr>
<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_pc_pm_vk.html" target="_self">inout::InParamPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA with probability Pc, Pm and Variable K </td></tr>
<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_in_param_without_pc_pm_vk.html" target="_self">inout::InParamWithoutPcPmVk&lt; T_CLUSTERIDX, T_REAL, T_FEATURE, T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Input parameter for GA without probability crossover (Pc) and mutation (Pm)<a class="el" href="citelist.html#CITEREF_Hruschka:Ebecken:GAClusteringLabelKVar:CGA:2003">[19]</a> </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance.html" target="_self">data::Instance&lt; T_FEATURE &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space </td></tr>
<tr id="row_18_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_class.html" target="_self">data::InstanceClass&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space, previamente clasificado </td></tr>
<tr id="row_18_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_1_" class="arrow" onclick="toggleFolder('18_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_freq.html" target="_self">data::InstanceFreq&lt; T_FEATURE, T_INSTANCE_FREQUENCY &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space, with an attribute to store occurrences of instances </td></tr>
<tr id="row_18_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_class_freq.html" target="_self">data::InstanceClassFreq&lt; T_FEATURE, T_INSTANCE_FREQUENCY, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space, which is classified and with a number of occurrences </td></tr>
<tr id="row_18_2_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_2_" class="arrow" onclick="toggleFolder('18_2_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_weight.html" target="_self">data::InstanceWeight&lt; T_FEATURE, T_WEIGHT &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space </td></tr>
<tr id="row_18_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_weight_class.html" target="_self">data::InstanceWeightClass&lt; T_FEATURE, T_WEIGHT, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space </td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structutils_1_1_instance_data_type.html" target="_self">utils::InstanceDataType</a></td><td class="desc">Structure For a data type of an attribute of an instance, it defines the data type recommended for the sum of the instances </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_20_" class="arrow" onclick="toggleFolder('20_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_iterfaz_class.html" target="_self">data::InstanceIterfazClass&lt; T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classdata_1_1_instance.html" title="Patterns, usually vectors in a multidimensional space.">Instance</a> with class </td></tr>
<tr id="row_20_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_class.html" target="_self">data::InstanceClass&lt; T_FEATURE, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space, previamente clasificado </td></tr>
<tr id="row_20_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_class_freq.html" target="_self">data::InstanceClassFreq&lt; T_FEATURE, T_INSTANCE_FREQUENCY, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space, which is classified and with a number of occurrences </td></tr>
<tr id="row_20_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdata_1_1_instance_weight_class.html" target="_self">data::InstanceWeightClass&lt; T_FEATURE, T_WEIGHT, T_INSTANCES_CLUSTER_K, T_CLUSTERIDX &gt;</a></td><td class="desc">Patterns, usually vectors in a multidimensional space </td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_interval_positive_integer.html" target="_self">runtime::IntervalPositiveInteger&lt; T_INTEGERDATATYPE &gt;</a></td><td class="desc">Interval of positive integer </td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_interval_positive_integer.html" target="_self">runtime::IntervalPositiveInteger&lt; T_INTEGERDOMAIN &gt;</a></td><td class="desc"></td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_iterator_partition_linked.html" target="_self">ds::IteratorPartitionLinked&lt; T_CLUSTERIDX &gt;</a></td><td class="desc">An iterator for a <a class="el" href="classds_1_1_partition_linked.html" title="Data structure to define the instances that belong to a cluster consecutively.">PartitionLinked</a> </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_line_split.html" target="_self">inout::LineSplit</a></td><td class="desc">Used for processing files to read </td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_list_runtime_function.html" target="_self">runtime::ListRuntimeFunction&lt; T_INTEGERDOMAIN &gt;</a></td><td class="desc"><a class="el" href="classruntime_1_1_list_runtime_function.html" title="ListRuntimeFunction store metrics in run time and count genetations.">ListRuntimeFunction</a> store metrics in run time and count genetations </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_26_" class="arrow" onclick="toggleFolder('26_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="classmat_1_1_matrix_base.html" title="MatrixBase.">MatrixBase</a> </td></tr>
<tr id="row_26_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_resizable_row.html" target="_self">mat::MatrixResizableRow&lt; T_FEATURE, T_WEIGHT &gt;</a></td><td class="desc"><a class="el" href="classmat_1_1_matrix_resizable_row.html" title="MatrixResizableRow .">MatrixResizableRow</a> <a class="el" href="citelist.html#CITEREF_Franti:etal:GAclustering:gafranti:1997">[17]</a> </td></tr>
<tr id="row_26_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_FEATURE &gt;</a></td><td class="desc">Matrix store items for row </td></tr>
<tr id="row_26_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_resizable_row.html" target="_self">mat::MatrixResizableRow&lt; T_FEATURE, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc"></td></tr>
<tr id="row_26_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_with_row_null.html" target="_self">mat::MatrixWithRowNull&lt; T_FEATURE &gt;</a></td><td class="desc"></td></tr>
<tr id="row_27_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_27_" class="arrow" onclick="toggleFolder('27_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_27_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_with_row_null.html" target="_self">mat::MatrixWithRowNull&lt; T &gt;</a></td><td class="desc"><a class="el" href="classmat_1_1_matrix_with_row_null.html" title="MatrixWithRowNull.">MatrixWithRowNull</a> </td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_28_" class="arrow" onclick="toggleFolder('28_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_DIST &gt;</a></td><td class="desc"></td></tr>
<tr id="row_28_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_DIST &gt;</a></td><td class="desc"></td></tr>
<tr id="row_29_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_29_" class="arrow" onclick="toggleFolder('29_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_FEATURE_SUM &gt;</a></td><td class="desc"></td></tr>
<tr id="row_29_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_resizable_row.html" target="_self">mat::MatrixResizableRow&lt; T_FEATURE_SUM, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc"></td></tr>
<tr id="row_29_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_FEATURE_SUM &gt;</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_30_" class="arrow" onclick="toggleFolder('30_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_GENE &gt;</a></td><td class="desc"></td></tr>
<tr id="row_30_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_30_0_" class="arrow" onclick="toggleFolder('30_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_with_row_null.html" target="_self">mat::MatrixWithRowNull&lt; T_GENE &gt;</a></td><td class="desc"></td></tr>
<tr id="row_30_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classgaencode_1_1_chromosome_matrix_with_row_null.html" target="_self">gaencode::ChromosomeMatrixWithRowNull&lt; T_GENE, T_METRIC &gt;</a></td><td class="desc">Matrix with row null chromosome </td></tr>
<tr id="row_31_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_31_" class="arrow" onclick="toggleFolder('31_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc"></td></tr>
<tr id="row_31_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_31_0_" class="arrow" onclick="toggleFolder('31_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc"></td></tr>
<tr id="row_31_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_31_0_0_" class="arrow" onclick="toggleFolder('31_0_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsm_1_1_partition_matrix.html" target="_self">sm::PartitionMatrix&lt; T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Partition Matrix also known as matching matrix is similar to the matrix of confusion, but is used in the unsupervised learning </td></tr>
<tr id="row_31_0_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsm_1_1_confusion_matching_matrix.html" target="_self">sm::ConfusionMatchingMatrix&lt; T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">Confusion Matching Matrix also known as an error matrix, is a specific table layout that allows visualization of the performance of an algorithm, typically a supervised learning </td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_32_" class="arrow" onclick="toggleFolder('32_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_METRIC &gt;</a></td><td class="desc"></td></tr>
<tr id="row_32_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_METRIC &gt;</a></td><td class="desc"></td></tr>
<tr id="row_33_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_33_" class="arrow" onclick="toggleFolder('33_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_base.html" target="_self">mat::MatrixBase&lt; T_U &gt;</a></td><td class="desc"></td></tr>
<tr id="row_33_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_row.html" target="_self">mat::MatrixRow&lt; T_U &gt;</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_triang.html" target="_self">mat::MatrixTriang&lt; T_FEATURE &gt;</a></td><td class="desc"><a class="el" href="classmat_1_1_matrix_triang.html" title="MatrixTriang.">MatrixTriang</a> </td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classmat_1_1_matrix_triang.html" target="_self">mat::MatrixTriang&lt; T_DIST &gt;</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classnearest_1_1_nearest_centroids.html" target="_self">nearest::NearestCentroids&lt; T_CLUSTERIDX, T_DIST &gt;</a></td><td class="desc">Stores the relationship between centroids, the closest and its distance </td></tr>
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_file_name.html" target="_self">inout::OutFileName</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_38_" class="arrow" onclick="toggleFolder('38_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_algorithm.html" target="_self">inout::OutParamAlgorithm</a></td><td class="desc">Output parameters for genetic algorithm </td></tr>
<tr id="row_38_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_38_0_" class="arrow" onclick="toggleFolder('38_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_clustering.html" target="_self">inout::OutParamClustering&lt; T_METRIC, T_CLUSTERIDX &gt;</a></td><td class="desc">Output parameters for a generic clustering algorithm </td></tr>
<tr id="row_38_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_38_0_0_" class="arrow" onclick="toggleFolder('38_0_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_g_a_c.html" target="_self">inout::OutParamGAC&lt; T_METRIC, T_CLUSTERIDX &gt;</a></td><td class="desc">Output Output parameters of the evolutionary algorithm </td></tr>
<tr id="row_38_0_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_g_a_medoid.html" target="_self">inout::OutParamGAMedoid&lt; T_METRIC, T_CLUSTERIDX &gt;</a></td><td class="desc"></td></tr>
<tr id="row_38_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_38_1_" class="arrow" onclick="toggleFolder('38_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_clustering.html" target="_self">inout::OutParamClustering&lt; T_METRIC, T_MEMBERCLUSTER_IDX &gt;</a></td><td class="desc"></td></tr>
<tr id="row_38_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_d_b_s_c_a_n.html" target="_self">inout::OutParamDBSCAN&lt; T_METRIC, T_MEMBERCLUSTER_IDX &gt;</a></td><td class="desc">Output parameter for DBSCAN Algorithmo <a class="el" href="citelist.html#CITEREF_Ester:Kriegel:Sander:Xu:Clustering:DBSCAN:1996">[Est]</a> </td></tr>
<tr id="row_38_1_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_kmeans.html" target="_self">inout::OutParamKmeans&lt; T_METRIC, T_MEMBERCLUSTER_IDX &gt;</a></td><td class="desc">Output parameter for Kmeans Algorithmo <a class="el" href="citelist.html#CITEREF_MacQueen:ClusterAnalysis:KMeans:1967">[31]</a> </td></tr>
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classinout_1_1_out_param_clustering_metric.html" target="_self">inout::OutParamClusteringMetric&lt; T_METRIC &gt;</a></td><td class="desc">Output parameters for a generic clustering algorithm </td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_40_" class="arrow" onclick="toggleFolder('40_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition.html" target="_self">partition::Partition&lt; T_CLUSTERIDX &gt;</a></td><td class="desc">Definition of the abstract class <a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a>, to build a cluster of a dataset </td></tr>
<tr id="row_40_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_centroids.html" target="_self">partition::PartitionCentroids&lt; T_FEATURE, T_CLUSTERIDX, T_DIST, INPUT_ITERATOR &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances in base to following equation: </p><p class="formulaDsp">
<img class="formulaDsp" alt="\[ x_i \in C_j \leftrightarrow \| x_i - \mu_j \| \begin{array}{c}min\\ k \end{array} \| x_i - \mu_k \|,\; j=1,2,..k, \]" src="form_46.png"/>
</p>
<p> where <img class="formulaInl" alt="$m_j$" src="form_8.png"/>, represents the medoid of cluster <img class="formulaInl" alt="$C_j$" src="form_5.png"/> </td></tr>
<tr id="row_40_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_crisp_matrix.html" target="_self">partition::PartitionCrispMatrix&lt; T_BITSIZE, T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances with bit crisp matrix </td></tr>
<tr id="row_40_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_disj_sets.html" target="_self">partition::PartitionDisjSets&lt; T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances in base DisjSets data structure </td></tr>
<tr id="row_40_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_fuzzy.html" target="_self">partition::PartitionFuzzy&lt; T_U, T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances with fuzzy matrix <a class="el" href="citelist.html#CITEREF_Bezdek:ClusterAnalysis:FCM:1974">[8]</a> <a class="el" href="citelist.html#CITEREF_Bezdek:etal:ClusterAnalysis:FCM:1984">[6]</a> </td></tr>
<tr id="row_40_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_label.html" target="_self">partition::PartitionLabel&lt; T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances with label string assigned previous </td></tr>
<tr id="row_40_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_label_vector.html" target="_self">partition::PartitionLabelVector&lt; T_CLUSTERIDX &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances with label vector assigned previous </td></tr>
<tr id="row_40_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classpartition_1_1_partition_medoids.html" target="_self">partition::PartitionMedoids&lt; T_INSTANCES_IDX, T_CLUSTERIDX, T_DIST &gt;</a></td><td class="desc"><a class="el" href="classpartition_1_1_partition.html" title="Definition of the abstract class Partition, to build a cluster of a dataset.">Partition</a> of instances with closest medoids </p><p class="formulaDsp">
<img class="formulaDsp" alt="\[ x_i \in C_j \leftrightarrow \| x_i - m_j \| \begin{array}{c}min\\ k \end{array} \| x_i - m_k \|,\; j=1,2,..k, \]" src="form_47.png"/>
</p>
<p> where <img class="formulaInl" alt="$m_j $" src="form_48.png"/>, represents the medoid of cluster <img class="formulaInl" alt="$C_j$" src="form_5.png"/> </td></tr>
<tr id="row_41_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_41_" class="arrow" onclick="toggleFolder('41_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_partition_linked.html" target="_self">ds::PartitionLinked&lt; T_CLUSTERIDX &gt;</a></td><td class="desc">Data structure to define the instances that belong to a cluster consecutively </td></tr>
<tr id="row_41_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_partition_linked_num_inst.html" target="_self">ds::PartitionLinkedNumInst&lt; T_CLUSTERIDX, T_INSTANCES_CLUSTER_K &gt;</a></td><td class="desc">A data structure for managing an instance partition with the number of instances per cluster </td></tr>
<tr id="row_41_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classds_1_1_partition_linked_stats.html" target="_self">ds::PartitionLinkedStats&lt; T_FEATURE, T_CLUSTERIDX, T_INSTANCE_FREQUENCY, T_INSTANCES_CLUSTER_K, T_FEATURE_SUM &gt;</a></td><td class="desc">Partition with an array of membership </td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structutils_1_1_run_once.html" target="_self">utils::RunOnce</a></td><td class="desc">Structure to ensure that a code or function is executed only once </td></tr>
<tr id="row_43_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_43_" class="arrow" onclick="toggleFolder('43_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_runtime_function.html" target="_self">runtime::RuntimeFunction</a></td><td class="desc">Function store metrics in run time </td></tr>
<tr id="row_43_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_43_0_" class="arrow" onclick="toggleFolder('43_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_runtime_function_value.html" target="_self">runtime::RuntimeFunctionValue&lt; T_VALUE &gt;</a></td><td class="desc">Function store metrics in run time </td></tr>
<tr id="row_43_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classruntime_1_1_runtime_function_stat.html" target="_self">runtime::RuntimeFunctionStat&lt; T_VALUE &gt;</a></td><td class="desc">Function statistical for metrics in run time </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Apr 19 2019 08:59:15 for Library Evolutionary Algorithms for Clustering (LEAC) by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
